Comparison of Steady State and Generational Genetic Algorithms for Use in Nonstationary Environments
نویسندگان
چکیده
The objective of this study is a comparison of two models of the genetic algorithm, the generational and incremental/steady state genetic algorithms, for use in nonstationary/dynamic environments. It is experimentally shown that choice of a suitable version of the genetic algorithm can improve its performance in such environments. This can extend ability of the genetic algorithm to track environmental changes which are relatively small and occur with low frequency without need to implement an additional technique for tracking changing optima.
منابع مشابه
A Comparative Study of Steady State and Generational Genetic Algorithms for Use in Nonstationary Environments
The objective of this study is a comparison of two models of a genetic algorithm the generational and incremental/steady state genetic algorithms for use in the nonstationary/dynamic environments. It is experimentally shown that selection of a suitable version of the genetic algorithm can improve performance of the genetic algorithm in such environments.This can extend ability of the genetic al...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملModelling the Dynamics of a Steady State Genetic Algorithm
A comparison is made between the dynamics of steady state and generational genetic algorithms using the statistical mechanics approach developed by Pr ugel-Bennett, Shapiro and Rattray. It is shown that the loss of variance of the population under steady state selection | genetic drift | occurs at twice the rate of generational selection. By considering a simple ones counting problem with selec...
متن کاملOptimisation in Time-Varying environments using Structured Genetic Algorithms
This paper describes the application of Structured Genetic Algorithms (sGA) for tracking an optimum in time-varying environments. This genetic model incorporates redundancy in chromosomal encoding of the problem space and uses a gene activation mechanism for the phenotypic expression of its subspaces. These features allow multiple changes to occur simultaneously, in addition to usual mixing eee...
متن کاملA Comparison of Evolutionary Algorithms for Automatic Calibration of Constrained Cellular Automata
We present a comparative study of seven evolutionary algorithms (Generational Genetic, Elitist Genetic, Steady State Genetic, Evolution Strategy, Evolution Strategy, generational and elitist Covariance Matrix Adaptation) for automatic calibration of a constrained cellular automaton (CCA), whose performance are assessed in terms of two fitness metrics (based on Kappa statistics and Lee-Salee Ind...
متن کامل